Min-Max K -vehicles windy rural postman problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A branch-price-and-cut method for the min-max k-windy rural postman problem

Given the edges of a graph, the postman problem consists of determining for a vehicle (postman) a shortest route that traverses all edges at least once. Each edge can be traversed in either direction and, when an edge is traversed more than once, the vehicle is said to be deadheading after its first traversal. The rural postman problem is the same as the postman problem except that the edges ar...

متن کامل

New facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem

In this paper the Min-Max version of the Windy Rural Postman Problem with several vehicles is introduced. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set of balanced tours for the vehicles, we present here an ILP formulation and study its associated polyhedron. Based on its partial description, a branch-and-cut algorithm has been imp...

متن کامل

Capacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm

This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Networks

سال: 2009

ISSN: 0028-3045

DOI: 10.1002/net.20334